Evolutionary Algorithms Applied to Landau-Gauge Fixing
نویسنده
چکیده
Current algorithms used to put a lattice gauge configuration into Landau gauge either suffer from the problem of critical slowing-down or involve an additional computational expense to overcome it. Evolutionary Algorithms (EAs), which have been widely applied to other global optimisation problems, may be of use in gauge fixing. Also, being global, they should not suffer from critical slowing-down as do local gradient based algorithms. We apply EA’s and also a Steepest Descent (SD) based method to the problem of Landau Gauge Fixing and compare their performance.
منابع مشابه
A global optimization method for Landau gauge fixing in Lattice QCD
An algorithm for gauge fixing to the Landau gauge in the fundamental modular region in lattice QCD is described. The method, a combination of an evolutionary algorithm with a steepest descent method, is able to solve the problem of the nonperturbative gauge fixing. The performance of the combined algorithm is investigated on 8, β = 5.7, and 16, β = 6.0, lattice SU(3) gauge configurations. Latti...
متن کاملAn algorithm for Landau gauge fixing in Lattice QCD
An algorithm for gauge fixing to the minimal Landau gauge in lattice QCD is described. The method, a combination of an evolutionary algorithm with a steepest descent method, is able to solve the problem of the nonperturbative gauge fixing. The performance of the combined algorithm is investigated on 8, β = 5.7, and 16, β = 6.0, lattice SU(3) gauge configurations.
متن کاملar X iv : h ep - l at / 9 90 90 64 v 1 9 S ep 1 99 9 1 OCHA - PP - 142 Landau Gauge Fixing supported by Genetic Algorithm
A class of algorithms for the Landau gauge fixing is proposed, which makes the steepest ascent (SA) method be more efficient by concepts of genetic algorithm. Main concern is how to incorporate random gauge transformation (RGT) to gain higher achievement of the minimal Landau gauge fixing, and to keep lower time consumption. One of these algorithms uses the block RGT, and another uses RGT contr...
متن کاملCritical Slowing-Down in SU (2) Landau Gauge-Fixing Algorithms
We study the problem of critical slowing-down for gauge-fixing algorithms (Landau gauge) in SU(2) lattice gauge theory on a 2-dimensional lattice. We consider five such algorithms, and lattice sizes ranging from 82 to 362 (up to 642 in the case of Fourier acceleration). We measure four different observables and we find that for each given algorithm they all have the same relaxation time within ...
متن کاملInvestigation of Laplacian gauge fixing for U(1) and SU(2) gauge fields.
The Laplacian gauge on the lattice is investigated numerically using U(1) and SU(2) gauge fields. The problem of Gribov ambiguities is addressed and to asses the smoothness of the gauge fixed configurations, they are compared to configurations fixed to the Landau gauge. The results of these comparisons with the Landau gauge indicate that Laplacian gauge fixing works very well in practice and of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998